TSTP Solution File: SEV057^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV057^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:41:12 EDT 2024

% Result   : Theorem 0.22s 0.42s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (   3 unt;   7 typ;   0 def)
%            Number of atoms       :  329 ( 158 equ;   0 cnn)
%            Maximal formula atoms :   16 (   8 avg)
%            Number of connectives :  486 (  97   ~;  77   |;  52   &; 242   @)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  133 (  45   ^  55   !;  32   ?; 133   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_4,type,
    sK0: a > $o ).

thf(func_def_5,type,
    sK1: ( a > a ) > a ).

thf(func_def_6,type,
    sK2: ( a > a ) > a ).

thf(func_def_7,type,
    sK3: a > ( a > a ) > a ).

thf(func_def_9,type,
    ph5: 
      !>[X0: $tType] : X0 ).

thf(f118,plain,
    $false,
    inference(avatar_sat_refutation,[],[f75,f78,f117]) ).

thf(f117,plain,
    ( spl4_2
    | ~ spl4_1 ),
    inference(avatar_split_clause,[],[f116,f69,f73]) ).

thf(f73,plain,
    ( spl4_2
  <=> ! [X0: a] :
        ( ( ( sK0 @ X0 )
         != $true )
        | ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 ) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

thf(f69,plain,
    ( spl4_1
  <=> ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

thf(f116,plain,
    ( ! [X0: a] :
        ( ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true ) )
    | ~ spl4_1 ),
    inference(subsumption_resolution,[],[f99,f71]) ).

thf(f71,plain,
    ( ( ( sK0
        @ ( sK1
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f69]) ).

thf(f99,plain,
    ! [X0: a] :
      ( ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
       != $true ) ),
    inference(duplicate_literal_removal,[],[f98]) ).

thf(f98,plain,
    ! [X0: a] :
      ( ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
       != $true )
      | ( ( sK0 @ X0 )
       != $true ) ),
    inference(beta_eta_normalization,[],[f97]) ).

thf(f97,plain,
    ! [X0: a] :
      ( ( $true
       != ( sK0
          @ ( ^ [Y0: a] : Y0
            @ ( sK1
              @ ^ [Y0: a] : Y0 ) ) ) )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) ) ),
    inference(duplicate_literal_removal,[],[f92]) ).

thf(f92,plain,
    ! [X0: a] :
      ( ( $true
       != ( sK0
          @ ( ^ [Y0: a] : Y0
            @ ( sK1
              @ ^ [Y0: a] : Y0 ) ) ) )
      | ( $true
       != ( sK0
          @ ( ^ [Y0: a] : Y0
            @ ( sK1
              @ ^ [Y0: a] : Y0 ) ) ) )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0 @ X0 )
       != $true ) ),
    inference(superposition,[],[f18,f19]) ).

thf(f19,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK2 @ X1 )
        = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
      | ( ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) )
       != $true )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) )
      | ( $true
       != ( sK0 @ X4 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f13,plain,
    ! [X1: a > a] :
      ( ( ( ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) )
         != $true )
        & ( $true
          = ( sK0 @ ( sK1 @ X1 ) ) ) )
      | ( ( ( sK0 @ ( sK2 @ X1 ) )
          = $true )
        & ! [X4: a] :
            ( ( $true
             != ( sK0 @ X4 ) )
            | ( ( $true
                = ( sK0 @ ( sK3 @ X4 @ X1 ) ) )
              & ( ( sK2 @ X1 )
                = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
              & ( ( sK3 @ X4 @ X1 )
               != X4 ) )
            | ( ( X1 @ X4 )
             != ( sK2 @ X1 ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9]) ).

thf(f9,plain,
    ( ? [X0: a > $o] :
      ! [X1: a > a] :
        ( ? [X2: a] :
            ( ( ( X0 @ ( X1 @ X2 ) )
             != $true )
            & ( ( X0 @ X2 )
              = $true ) )
        | ? [X3: a] :
            ( ( ( X0 @ X3 )
              = $true )
            & ! [X4: a] :
                ( ( ( X0 @ X4 )
                 != $true )
                | ? [X5: a] :
                    ( ( ( X0 @ X5 )
                      = $true )
                    & ( ( X1 @ X5 )
                      = X3 )
                    & ( X4 != X5 ) )
                | ( ( X1 @ X4 )
                 != X3 ) ) ) )
   => ! [X1: a > a] :
        ( ? [X2: a] :
            ( ( $true
             != ( sK0 @ ( X1 @ X2 ) ) )
            & ( $true
              = ( sK0 @ X2 ) ) )
        | ? [X3: a] :
            ( ( $true
              = ( sK0 @ X3 ) )
            & ! [X4: a] :
                ( ( $true
                 != ( sK0 @ X4 ) )
                | ? [X5: a] :
                    ( ( ( sK0 @ X5 )
                      = $true )
                    & ( ( X1 @ X5 )
                      = X3 )
                    & ( X4 != X5 ) )
                | ( ( X1 @ X4 )
                 != X3 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ! [X1: a > a] :
      ( ? [X2: a] :
          ( ( $true
           != ( sK0 @ ( X1 @ X2 ) ) )
          & ( $true
            = ( sK0 @ X2 ) ) )
     => ( ( ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) )
         != $true )
        & ( $true
          = ( sK0 @ ( sK1 @ X1 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f11,plain,
    ! [X1: a > a] :
      ( ? [X3: a] :
          ( ( $true
            = ( sK0 @ X3 ) )
          & ! [X4: a] :
              ( ( $true
               != ( sK0 @ X4 ) )
              | ? [X5: a] :
                  ( ( ( sK0 @ X5 )
                    = $true )
                  & ( ( X1 @ X5 )
                    = X3 )
                  & ( X4 != X5 ) )
              | ( ( X1 @ X4 )
               != X3 ) ) )
     => ( ( ( sK0 @ ( sK2 @ X1 ) )
          = $true )
        & ! [X4: a] :
            ( ( $true
             != ( sK0 @ X4 ) )
            | ? [X5: a] :
                ( ( ( sK0 @ X5 )
                  = $true )
                & ( ( sK2 @ X1 )
                  = ( X1 @ X5 ) )
                & ( X4 != X5 ) )
            | ( ( X1 @ X4 )
             != ( sK2 @ X1 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f12,plain,
    ! [X1: a > a,X4: a] :
      ( ? [X5: a] :
          ( ( ( sK0 @ X5 )
            = $true )
          & ( ( sK2 @ X1 )
            = ( X1 @ X5 ) )
          & ( X4 != X5 ) )
     => ( ( $true
          = ( sK0 @ ( sK3 @ X4 @ X1 ) ) )
        & ( ( sK2 @ X1 )
          = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
        & ( ( sK3 @ X4 @ X1 )
         != X4 ) ) ),
    introduced(choice_axiom,[]) ).

thf(f8,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X2: a] :
          ( ( ( X0 @ ( X1 @ X2 ) )
           != $true )
          & ( ( X0 @ X2 )
            = $true ) )
      | ? [X3: a] :
          ( ( ( X0 @ X3 )
            = $true )
          & ! [X4: a] :
              ( ( ( X0 @ X4 )
               != $true )
              | ? [X5: a] :
                  ( ( ( X0 @ X5 )
                    = $true )
                  & ( ( X1 @ X5 )
                    = X3 )
                  & ( X4 != X5 ) )
              | ( ( X1 @ X4 )
               != X3 ) ) ) ),
    inference(rectify,[],[f7]) ).

thf(f7,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X5: a] :
          ( ( $true
           != ( X0 @ ( X1 @ X5 ) ) )
          & ( ( X0 @ X5 )
            = $true ) )
      | ? [X2: a] :
          ( ( ( X0 @ X2 )
            = $true )
          & ! [X3: a] :
              ( ( ( X0 @ X3 )
               != $true )
              | ? [X4: a] :
                  ( ( ( X0 @ X4 )
                    = $true )
                  & ( ( X1 @ X4 )
                    = X2 )
                  & ( X3 != X4 ) )
              | ( ( X1 @ X3 )
               != X2 ) ) ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ? [X0: a > $o] :
    ! [X1: a > a] :
      ( ? [X2: a] :
          ( ! [X3: a] :
              ( ( ( X1 @ X3 )
               != X2 )
              | ? [X4: a] :
                  ( ( X3 != X4 )
                  & ( ( X1 @ X4 )
                    = X2 )
                  & ( ( X0 @ X4 )
                    = $true ) )
              | ( ( X0 @ X3 )
               != $true ) )
          & ( ( X0 @ X2 )
            = $true ) )
      | ? [X5: a] :
          ( ( $true
           != ( X0 @ ( X1 @ X5 ) ) )
          & ( ( X0 @ X5 )
            = $true ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > $o] :
      ? [X1: a > a] :
        ( ! [X2: a] :
            ( ( ( X0 @ X2 )
              = $true )
           => ? [X3: a] :
                ( ( ( X1 @ X3 )
                  = X2 )
                & ! [X4: a] :
                    ( ( ( ( X1 @ X4 )
                        = X2 )
                      & ( ( X0 @ X4 )
                        = $true ) )
                   => ( X3 = X4 ) )
                & ( ( X0 @ X3 )
                  = $true ) ) )
        & ! [X5: a] :
            ( ( ( X0 @ X5 )
              = $true )
           => ( $true
              = ( X0 @ ( X1 @ X5 ) ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ! [X0: a > $o] :
      ? [X1: a > a] :
        ( ! [X2: a] :
            ( ( X0 @ X2 )
           => ? [X3: a] :
                ( ( ( X1 @ X3 )
                  = X2 )
                & ( X0 @ X3 )
                & ! [X4: a] :
                    ( ( ( ( X1 @ X4 )
                        = X2 )
                      & ( X0 @ X4 ) )
                   => ( X3 = X4 ) ) ) )
        & ! [X5: a] :
            ( ( X0 @ X5 )
           => ( X0 @ ( X1 @ X5 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a > $o] :
      ? [X1: a > a] :
        ( ! [X3: a] :
            ( ( X0 @ X3 )
           => ? [X2: a] :
                ( ( ( X1 @ X2 )
                  = X3 )
                & ( X0 @ X2 )
                & ! [X4: a] :
                    ( ( ( ( X1 @ X4 )
                        = X3 )
                      & ( X0 @ X4 ) )
                   => ( X2 = X4 ) ) ) )
        & ! [X2: a] :
            ( ( X0 @ X2 )
           => ( X0 @ ( X1 @ X2 ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a > $o] :
    ? [X1: a > a] :
      ( ! [X3: a] :
          ( ( X0 @ X3 )
         => ? [X2: a] :
              ( ( ( X1 @ X2 )
                = X3 )
              & ( X0 @ X2 )
              & ! [X4: a] :
                  ( ( ( ( X1 @ X4 )
                      = X3 )
                    & ( X0 @ X4 ) )
                 => ( X2 = X4 ) ) ) )
      & ! [X2: a] :
          ( ( X0 @ X2 )
         => ( X0 @ ( X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.TnC5H50D6u/Vampire---4.8_13548',cEQP1_1A_pme) ).

thf(f18,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK3 @ X4 @ X1 )
       != X4 )
      | ( ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) )
       != $true )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) )
      | ( $true
       != ( sK0 @ X4 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f78,plain,
    ~ spl4_2,
    inference(avatar_contradiction_clause,[],[f77]) ).

thf(f77,plain,
    ( $false
    | ~ spl4_2 ),
    inference(subsumption_resolution,[],[f76,f24]) ).

thf(f24,plain,
    ( ( sK0
      @ ( sK2
        @ ^ [Y0: a] : Y0 ) )
    = $true ),
    inference(trivial_inequality_removal,[],[f23]) ).

thf(f23,plain,
    ( ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ( $true != $true ) ),
    inference(duplicate_literal_removal,[],[f22]) ).

thf(f22,plain,
    ( ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
      = $true )
    | ( $true != $true ) ),
    inference(superposition,[],[f21,f17]) ).

thf(f17,plain,
    ! [X1: a > a] :
      ( ( $true
        = ( sK0 @ ( sK1 @ X1 ) ) )
      | ( ( sK0 @ ( sK2 @ X1 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f21,plain,
    ! [X1: a > a] :
      ( ( ( sK0 @ ( X1 @ ( sK1 @ X1 ) ) )
       != $true )
      | ( ( sK0 @ ( sK2 @ X1 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f76,plain,
    ( ( ( sK0
        @ ( sK2
          @ ^ [Y0: a] : Y0 ) )
     != $true )
    | ~ spl4_2 ),
    inference(equality_resolution,[],[f74]) ).

thf(f74,plain,
    ( ! [X0: a] :
        ( ( ( sK2
            @ ^ [Y0: a] : Y0 )
         != X0 )
        | ( ( sK0 @ X0 )
         != $true ) )
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f73]) ).

thf(f75,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f56,f73,f69]) ).

thf(f56,plain,
    ! [X0: a] :
      ( ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 ) ),
    inference(duplicate_literal_removal,[],[f55]) ).

thf(f55,plain,
    ! [X0: a] :
      ( ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 ) ),
    inference(beta_eta_normalization,[],[f54]) ).

thf(f54,plain,
    ! [X0: a] :
      ( ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 )
      | ( ( sK0 @ X0 )
       != $true ) ),
    inference(duplicate_literal_removal,[],[f51]) ).

thf(f51,plain,
    ! [X0: a] :
      ( ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0
          @ ( sK1
            @ ^ [Y0: a] : Y0 ) )
        = $true )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != ( ^ [Y0: a] : Y0
          @ X0 ) )
      | ( ( sK0 @ X0 )
       != $true )
      | ( ( sK2
          @ ^ [Y0: a] : Y0 )
       != X0 ) ),
    inference(superposition,[],[f14,f15]) ).

thf(f15,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK2 @ X1 )
        = ( X1 @ ( sK3 @ X4 @ X1 ) ) )
      | ( $true
       != ( sK0 @ X4 ) )
      | ( $true
        = ( sK0 @ ( sK1 @ X1 ) ) )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f14,plain,
    ! [X1: a > a,X4: a] :
      ( ( ( sK3 @ X4 @ X1 )
       != X4 )
      | ( $true
        = ( sK0 @ ( sK1 @ X1 ) ) )
      | ( $true
       != ( sK0 @ X4 ) )
      | ( ( X1 @ X4 )
       != ( sK2 @ X1 ) ) ),
    inference(cnf_transformation,[],[f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SEV057^5 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 11:30:21 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_EQU_NAR problem
% 0.14/0.36  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.TnC5H50D6u/Vampire---4.8_13548
% 0.14/0.38  % (13713)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38  % (13714)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.38  % (13713)Instruction limit reached!
% 0.14/0.38  % (13713)------------------------------
% 0.14/0.38  % (13713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (13713)Termination reason: Unknown
% 0.14/0.38  % (13713)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (13713)Memory used [KB]: 5500
% 0.14/0.38  % (13713)Time elapsed: 0.003 s
% 0.14/0.38  % (13713)Instructions burned: 2 (million)
% 0.14/0.38  % (13713)------------------------------
% 0.14/0.38  % (13713)------------------------------
% 0.14/0.38  % (13714)Refutation not found, incomplete strategy
% 0.14/0.38  % (13714)------------------------------
% 0.14/0.38  % (13714)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (13714)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  % (13714)Memory used [KB]: 5500
% 0.14/0.38  % (13714)Time elapsed: 0.005 s
% 0.14/0.38  % (13714)Instructions burned: 3 (million)
% 0.14/0.38  % (13714)------------------------------
% 0.14/0.38  % (13714)------------------------------
% 0.14/0.38  % (13710)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.38  % (13716)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.14/0.39  % (13711)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.14/0.39  % (13712)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.39  % (13715)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.39  % (13709)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.14/0.39  % (13710)Instruction limit reached!
% 0.14/0.39  % (13710)------------------------------
% 0.14/0.39  % (13710)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (13716)Instruction limit reached!
% 0.14/0.39  % (13716)------------------------------
% 0.14/0.39  % (13716)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (13716)Termination reason: Unknown
% 0.14/0.39  % (13716)Termination phase: Saturation
% 0.14/0.39  
% 0.14/0.39  % (13716)Memory used [KB]: 5500
% 0.14/0.39  % (13716)Time elapsed: 0.005 s
% 0.14/0.39  % (13716)Instructions burned: 4 (million)
% 0.14/0.39  % (13716)------------------------------
% 0.14/0.39  % (13716)------------------------------
% 0.14/0.39  % (13710)Termination reason: Unknown
% 0.14/0.39  % (13710)Termination phase: Saturation
% 0.14/0.39  
% 0.14/0.39  % (13710)Memory used [KB]: 5500
% 0.14/0.39  % (13710)Time elapsed: 0.005 s
% 0.14/0.39  % (13710)Instructions burned: 5 (million)
% 0.14/0.39  % (13710)------------------------------
% 0.14/0.39  % (13710)------------------------------
% 0.14/0.39  % (13712)Instruction limit reached!
% 0.14/0.39  % (13712)------------------------------
% 0.14/0.39  % (13712)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (13712)Termination reason: Unknown
% 0.14/0.39  % (13712)Termination phase: Property scanning
% 0.14/0.39  
% 0.14/0.39  % (13712)Memory used [KB]: 895
% 0.14/0.39  % (13712)Time elapsed: 0.004 s
% 0.14/0.39  % (13712)Instructions burned: 2 (million)
% 0.14/0.39  % (13712)------------------------------
% 0.14/0.39  % (13712)------------------------------
% 0.14/0.39  % (13711)Refutation not found, incomplete strategy
% 0.14/0.39  % (13711)------------------------------
% 0.14/0.39  % (13711)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39  % (13711)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39  
% 0.14/0.39  
% 0.14/0.39  % (13711)Memory used [KB]: 5500
% 0.14/0.39  % (13711)Time elapsed: 0.007 s
% 0.14/0.39  % (13711)Instructions burned: 4 (million)
% 0.14/0.39  % (13711)------------------------------
% 0.14/0.39  % (13711)------------------------------
% 0.14/0.39  % (13717)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.14/0.40  % (13718)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.14/0.40  % (13719)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.40  % (13715)Instruction limit reached!
% 0.14/0.40  % (13715)------------------------------
% 0.14/0.40  % (13715)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (13715)Termination reason: Unknown
% 0.14/0.40  % (13715)Termination phase: Saturation
% 0.14/0.40  
% 0.14/0.40  % (13715)Memory used [KB]: 5628
% 0.14/0.40  % (13715)Time elapsed: 0.019 s
% 0.14/0.40  % (13715)Instructions burned: 18 (million)
% 0.14/0.40  % (13715)------------------------------
% 0.14/0.40  % (13715)------------------------------
% 0.14/0.40  % (13719)Instruction limit reached!
% 0.14/0.40  % (13719)------------------------------
% 0.14/0.40  % (13719)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40  % (13719)Termination reason: Unknown
% 0.14/0.40  % (13719)Termination phase: Saturation
% 0.14/0.40  
% 0.14/0.40  % (13719)Memory used [KB]: 5500
% 0.14/0.40  % (13719)Time elapsed: 0.005 s
% 0.14/0.40  % (13719)Instructions burned: 4 (million)
% 0.14/0.40  % (13719)------------------------------
% 0.14/0.40  % (13719)------------------------------
% 0.14/0.41  % (13720)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on Vampire---4 for (2999ds/1041Mi)
% 0.14/0.41  % (13721)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.14/0.41  % (13718)Instruction limit reached!
% 0.14/0.41  % (13718)------------------------------
% 0.14/0.41  % (13718)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41  % (13718)Termination reason: Unknown
% 0.14/0.41  % (13718)Termination phase: Saturation
% 0.14/0.41  
% 0.14/0.41  % (13718)Memory used [KB]: 5500
% 0.14/0.41  % (13718)Time elapsed: 0.011 s
% 0.14/0.41  % (13718)Instructions burned: 16 (million)
% 0.14/0.41  % (13718)------------------------------
% 0.14/0.41  % (13718)------------------------------
% 0.14/0.41  % (13721)Instruction limit reached!
% 0.14/0.41  % (13721)------------------------------
% 0.14/0.41  % (13721)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41  % (13721)Termination reason: Unknown
% 0.14/0.41  % (13721)Termination phase: Saturation
% 0.14/0.41  
% 0.14/0.41  % (13721)Memory used [KB]: 1023
% 0.14/0.41  % (13721)Time elapsed: 0.006 s
% 0.14/0.41  % (13721)Instructions burned: 7 (million)
% 0.14/0.41  % (13721)------------------------------
% 0.14/0.41  % (13721)------------------------------
% 0.14/0.41  % (13722)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on Vampire---4 for (2999ds/16Mi)
% 0.14/0.41  % (13709)First to succeed.
% 0.14/0.41  % (13717)Instruction limit reached!
% 0.14/0.41  % (13717)------------------------------
% 0.14/0.41  % (13717)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.41  % (13717)Termination reason: Unknown
% 0.14/0.41  % (13717)Termination phase: Saturation
% 0.14/0.41  
% 0.14/0.41  % (13717)Memory used [KB]: 5884
% 0.14/0.41  % (13717)Time elapsed: 0.022 s
% 0.14/0.41  % (13717)Instructions burned: 38 (million)
% 0.14/0.41  % (13717)------------------------------
% 0.14/0.41  % (13717)------------------------------
% 0.22/0.42  % (13709)Refutation found. Thanks to Tanya!
% 0.22/0.42  % SZS status Theorem for Vampire---4
% 0.22/0.42  % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.42  % (13709)------------------------------
% 0.22/0.42  % (13709)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.42  % (13709)Termination reason: Refutation
% 0.22/0.42  
% 0.22/0.42  % (13709)Memory used [KB]: 5756
% 0.22/0.42  % (13709)Time elapsed: 0.029 s
% 0.22/0.42  % (13709)Instructions burned: 49 (million)
% 0.22/0.42  % (13709)------------------------------
% 0.22/0.42  % (13709)------------------------------
% 0.22/0.42  % (13708)Success in time 0.047 s
% 0.22/0.42  % Vampire---4.8 exiting
%------------------------------------------------------------------------------